package 力扣算法练习.main1.newPart1;

public class day16 {
    //https://www.nowcoder.com/practice/953b74ca5c4d44bb91f39ac4ddea0fee?tpId=230&tqId=39750&ru=/exam/oj
    //最开始传入的now是指0位置的台阶
    private static int jump(int n,int now){
        if(now==n){
            return 1;
        }else if(now>n){
            return 0;
        }
        int count=0;
        for(int i=1;i<=n;i++){
            count+=jump(n,now+i);
        }
        return count;
    }


}
